Tableaux for Dynamic Logic of Propositional Assignments
نویسندگان
چکیده
The Dynamic Logic for Propositional Assignments (DL-PA) has recently been studied as an alternative to Propositional Dynamic Logic (PDL). In DL-PA, the abstract atomic programs of PDL are replaced by assignments of propositional variables to truth values. This makes DL-PA enjoy some interesting meta-logical properties that PDL does not, such as eliminability of the Kleene star, compactness and interpolation. We define and analytic tableaux calculus for DL-PA and show that it matches the known complexity results.
منابع مشابه
Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL
This paper presents a prefixed tableaux calculus for Propositional Dynamic Logic with Converse based on a combination of different techniques such as prefixed tableaux for modal logics and model checkers for +-calculus. We prove the correctness and completeness of the calculus and illustrate its features. We also discuss the transformation of the tableaux method (naively NEXPTIME) into an EXPTI...
متن کاملSuperficial Tableaux for Contextual Reasoning
This paper presents a tableaux calculus for the Propositional Logic of Contexts with the ist(c,¢) modality. This approach has a twofold advantage: from the user viewpoint it presents rules which intuitively reflect epistemic properties (lifting, use of assumptions etc.); from a computational perspective it allows local and incremental computation, satisfies strong confluence and can therefore b...
متن کاملJudgement Aggregation in Dynamic Logic of Propositional Assignments
Judgment aggregation studies situations where groups of agents take a collective decision over a number of logically interconnected issues. A recent stream of papers is dedicated to modelling frameworks of social choice theory, including judgment aggregation, within logical calculi usually designed ad hoc for this purpose. In contrast, we propose the use of dynamic logic of propositional assign...
متن کاملTableaux and Algorithms for Propositional Dynamic Logic with Converse
This paper presents a pre xed tableaux calculus for Proposi tional Dynamic Logic with Converse based on a combination of di erent techniques such as pre xed tableaux for modal logics and model checkers for mu calculus We prove the correctness and completeness of the calcu lus and illustrate its features We also discuss the transformation of the tableaux method naively NEXPTIME into an EXPTIME a...
متن کاملTerminating Tableaux for Modal Logic with Transitive Closure
We present a terminating tableau system for the modal logic K∗. K∗ extends the basic modal logic K with a reflexive transitive closure operator for relations and is a proper fragment of propositional dynamic logic. We investigate two different approaches to achieve termination, namely chain-based blocking and pattern-based blocking. Pattern based-blocking has not been applied to a modal logic w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1406.2161 شماره
صفحات -
تاریخ انتشار 2014